Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
¸ÖƼÄÚ¾î ȯ°æ¿¡¼ÀÇ Á¢¹Ì»ç Æ®¸® º´·Ä »ý¼º ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Parallel Construction of Suffix Trees on Multi-core Platforms |
ÀúÀÚ(Author) |
¼ÁØÈ£
³ªÁßä
JunHo Seo
JoongChae Na
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 18 NO. 11 PP. 0799 ~ 0803 (2012. 11) |
Çѱ۳»¿ë (Korean Abstract) |
Á¢¹Ì»ç Æ®¸®´Â ¹®ÀÚ¿ ¾ÐÃà, ÅؽºÆ® ó¸®, »ý¹°Á¤º¸ÇÐ µî ´Ù¾çÇÑ ÀÀ¿ë ºÐ¾ß¿¡¼ »ç¿ëµÇ´Â ÀڷᱸÁ¶ÀÌ´Ù. ÃÖ±Ù ºÐ»ê ½Ã½ºÅÛ, ¸ÖƼÄÚ¾î CPU µî º´·Äó¸® ½Ã½ºÅÛÀÌ º¸±ÞµÊ¿¡ µû¶ó Á¢¹Ì»ç Æ®¸®¸¦ º´·Ä·Î »ý¼ºÇÏ´Â ¾Ë°í¸®ÁòÀÇ ±¸Çö¿¡ ´ëÇÑ ¿¬±¸°¡ È°¹ßÈ÷ ÁøÇàµÇ°í ÀÖ´Ù. º» ³í¹®¿¡¼´Â Threading Building Blocks(TBB)¿Í Cilk Plus º´·Ä ¶óÀ̺귯¸®¸¦ ÀÌ¿ëÇÏ¿© ¸ÖƼÄÚ¾î ȯ°æ¿¡¼ µ¿ÀÛÇÏ´Â º´·Ä Á¢¹Ì»ç Æ®¸® »ý¼º ¾Ë°í¸®ÁòÀ» ½ÇÁ¦·Î ±¸ÇöÇÑ´Ù. º» ³í¹®ÀÇ ±¸ÇöÀº ºÐ»ê½Ã½ºÅÛ¿¡¼ ±¸ÇöµÈ Chen°ú SchmidtÀÇ ¾Ë°í¸®ÁòÀ» ±â¹ÝÀ¸·Î ÇÑ´Ù. ¶ÇÇÑ ´Ù¾çÇÑ Á¾·ùÀÇ ÀÔ·Â ¹®ÀÚ¿¿¡ ´ëÇÑ ½ÇÇèÀ» ÅëÇÏ¿© ±¸ÇöµÈ ¾Ë°í¸®ÁòÀÇ ¼º´ÉÀ» ºñ±³ ºÐ¼®ÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
The suffix tree is a data structure used in a wide range of domains such as data compression, text processing, computational biology, and so on. Recently, as parallel architectures such as distributed systems and multi-core CPUs have been developed, there has been studies on implementing the parallel construction of the suffix tree. In this paper, we implement a parallel suffix tree construction algorithm on multi-core platforms using parallel libraries, Threading Building Blocks (TBB) and Cilk Plus. Our implementation is based on Chen and Schmidt¡¯s algorithm proposed for distributed systems. Furthermore, through experiments with various kinds of input strings, we measure and analyze the performance of the parallel algorithms
|
Å°¿öµå(Keyword) |
Á¢¹Ì»çÆ®¸®
º´·Ä¾Ë°í¸®Áò
Suffix Tree
Parallel Algorithm
TBB
Cilk Plus
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|